Cone decompositions of non-simple polytopes
نویسندگان
چکیده
منابع مشابه
Simple Extensions of Polytopes
We introduce the simple extension complexity of a polytope P as the smallest number of facets of any simple (i.e., non-degenerate in the sense of linear programming) polytope which can be projected onto P . We devise a combinatorial method to establish lower bounds on the simple extension complexity and show for several polytopes that they have large simple extension complexities. These example...
متن کاملNew Polytope Decompositions and Euler-maclaurin Formulas for Simple Integral Polytopes
We use a version of localization in equivariant cohomology for the norm-square of the moment map, described by Paradan, to give several weighted decompositions for simple polytopes. As an application, we study Euler-Maclaurin formulas.
متن کاملSimple Non-Rational Convex Polytopes via Symplectic Geometry
In this article we consider a generalization of manifolds and orbifolds which we call quasifolds; quasifolds of dimension k are locally isomorphic to the quotient of the space R k by the action of a discrete group typically they are not Hausdorff topological spaces. The analogue of a torus in this geometry is a quasitorus. We define Hamiltonian actions of quasitori on symplectic quasifolds and ...
متن کاملLinear Programming, the Simplex Algorithm and Simple Polytopes
In the first part of the paper we survey some far reaching applications of the basis facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concurring the simplex algorithm. We describe sub-exponential randomized pivot roles and upper bounds on the diameter of graphs of polytopes.
متن کاملApproximate cone factorizations and lifts of polytopes
In this paper we show how to construct inner and outer convex approximations of a polytope from an approximate cone factorization of its slack matrix. This provides a robust generalization of the famous result of Yannakakis that polyhedral lifts of a polytope are controlled by (exact) nonnegative factorizations of its slack matrix. Our approximations behave well under polarity and have efficien...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symplectic Geometry
سال: 2016
ISSN: 1527-5256,1540-2347
DOI: 10.4310/jsg.2016.v14.n3.a4